Orthogonal thickness of graphs
نویسندگان
چکیده
منابع مشابه
Generalization of matching extensions in graphs-combinatorial interpretation of orthogonal and q-orthogonal polynomials
In this paper, we present generalization of matching extensions in graphs and we derive combinatorial interpretation of wide classes of orthogonal and q-orthogonal polynomials. Specifically, we assign general weights to complete graphs, cycles and chains or paths defining matching extensions in these graphs. The generalized matching polynomials of these graphs have recurrences defining various ...
متن کاملUsing Taguchi Experimental Design Method for Obtaining Suitable Thickness in Decora-tive Chromium Electroplating
In this study, Taguchi experimental design has been used for the optimization of thickness of chromium layers. For this purpose brass materials have been electroplated under various conditions of the process. An orthogonal array (OA) was employed to analyze the effect of plating parameters on the characteristic of the thickness. Variables which were considered for working were as following; amo...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملA class of orthogonal latin square graphs
An orthogonal latin square graph is a graph whose vertices are latin squares of the same order, adjacency being synonymous with orthogonality. We are interested in orthogonal latin square graphs in which each square is orthogonal to the Cayley table M of a group G and is obtained from M by permuting columns. These permutations, regarded as permutations of G, are orthomorphisms of G and the grap...
متن کاملThickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin's graphs
The purpose of this paper is to offer new insight and tools toward the pursuit of the largest chromatic number in the class of thickness-two graphs. At present, the highest chromatic number known for a thickness-two graph is 9, and there is only one known color-critical 1 such graph. We introduce 40 small 9-critical thickness-two graphs, and then use a new construction, the permuted layer graph...
متن کامل